On Games of Perfect Information: Equilibria, E-Equilibria and Approximation by Simple Games

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Games of Perfect Information: Equilibria, ε-Equilibria and Approximation by Simple Games

We show that every bounded, continuous at infinity game of perfect information has an ε−perfect equilibrium. Our method consists of approximating the payoff function of each player by a sequence of simple functions, and to consider the corresponding sequence of games, each differing form the original game only on the payoff function. In addition, this approach yields a new characterization of p...

متن کامل

On Nash-Equilibria of Approximation-Stable Games

One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ǫ-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the no...

متن کامل

Undominated (and) perfect equilibria in Poisson games

In games with population uncertainty some perfect equilibria are in dominated strategies. We prove that every Poisson game has at least one perfect equilibrium in undominated strategies.

متن کامل

Subgame-Perfect Equilibria for Stochastic Games

For an n-person stochastic game with Borel state space S and compact metric action sets A1, A2, . . . , An, sufficient conditions are given for the existence of subgame perfect equilibria. One result is that such equilibria exist if the law of motion q(·|s, a) is, for fixed s, continuous in a = (a1, a2, . . . , an) for the total variation norm and the payoff functions f1, f2, . . . , fn are bou...

متن کامل

Subgame perfect equilibria in stopping games

Stopping games (without simultaneous stopping) are sequential games in which at every stage one of the players is chosen according to a stochastic process, and that player decides whether to continue the interaction or stop it, whereby the terminal payoff vector is obtained by another stochastic process. We prove that if the payoff process is integrable, a δ-approximate subgame perfect -equilib...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2003

ISSN: 1556-5068

DOI: 10.2139/ssrn.882045